Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
نویسندگان
چکیده
منابع مشابه
Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملFenchel decomposition for stochastic mixed-integer programming
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming (SMIP) called Fenchel decomposition (FD). FD uses a class of valid inequalities termed, FD cuts, which are derived based on Fenchel cutting planes from integer programming. First, we derive FD cuts based on both the first and second-stage variables, and devise an FD algorithm for SMIP and establi...
متن کاملMixed-integer Programming Based Approaches for the Movement Planner Problem: Model, Heuristics and Decomposition
We formulate the Movement Planner Problem as a mixed-integer linear program (MILP). The novelty of our approach is that we integrate the strengths of the two previous formulations: we draw on the concept of segments in [Törnquist and Persson(2007)] and network representation in [Mu and Dessouky(2011)] so that unlike [Törnquist and Persson(2007)], we are able to model switches and sidings explic...
متن کاملMixed-integer linear programming heuristics for the prepack optimization problem
In this paper we consider a packing problem arising in inventory allocation applications, where the operational cost for packing the bins is comparable, or even higher, than the cost of the bins (and of the items) themselves. This is the case, for example, of warehouses that have to manage a large number of different customers (e.g., stores), each requiring a given set of items. For this proble...
متن کاملStructure-based primal heuristics for mixed integer programming
Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They help to reach optimality faster and provide good feasible solutions early in the solving process. In this paper, we present two new primal heuristics which take into account global structures available within MIP solvers to construct feasible solutions at the beginning of the solving process. These he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2016
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-016-2352-8